PUNISHMENT DURING FIXED-INTERVAL REINFORCEMENT1
نویسندگان
چکیده
منابع مشابه
Learning Strict Nash Equilibria through Reinforcement1
This paper studies the analytical properties of the reinforcement learning model proposed in Erev and Roth (1998), also termed cumulative reinforcement learning in Laslier et al. (2001). The stochastic model of learning accounts for two main elements: the Law of E¤ect (positive reinforcement of actions that perform well) and the Power Law of Practice (learning curves tend to be steeper initiall...
متن کاملInterval censored regression with fixed effects
This paper considers estimation of a fixed-effects model with an interval-censored dependent variable. In each time period, the researcher observes the interval (with known endpoints) in which the dependent variable lies but not the value of the dependent variable itself. Two versions of the model are considered, a parametric model with logistic errors and a semiparametric model with errors hav...
متن کاملInterval Completion Is Fixed Parameter Tractable
We present an algorithm with runtime O(knm) for the following NP-complete problem [9, problem GT35]: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the long-standing open question [17, 7, 25, 14], first posed by Kaplan, Shamir and Tarjan, of whether this problem was fixed parameter tractable. The problem ha...
متن کاملUnit Interval Editing is Fixed-Parameter Tractable
Given a graph G and integers k1, k2, and k3, the unit interval editing problem asks whether G can be transformed into a unit interval graph by at most k1 vertex deletions, k2 edge deletions, and k3 edge additions. We give an algorithm solving this problem in time 2 logk) · (n+m), where k := k1 +k2 +k3, and n,m denote respectively the numbers of vertices and edges of G. Therefore, it is fixed-pa...
متن کاملOptimal Fixed Interval Satellite Range Scheduling
The satellite scheduling community has provided several algorithms for allocating interaction windows between ground stations and satellites, from simple greedy approaches to more complex hybrid-genetic or Lagrangian-relaxation techniques. Single-location ground station problems, where requests have fixed time intervals and no priorities, are known to be solvable in polynomial time. To the best...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Experimental Analysis of Behavior
سال: 1961
ISSN: 0022-5002
DOI: 10.1901/jeab.1961.4-343